منابع مشابه
Multiobjective optimization using an adaptive weighting scheme
A new Pareto front approximation method is proposed for multiobjective optimization problems with bound constraints. The method employs a hybrid optimization approach using two derivative free direct search techniques, and intends to solve blackbox simulation based multiobjective optimization problems where the analytical form of the objectives is not known and/or the evaluation of the objectiv...
متن کاملDynamic weighting in Monte Carlo and optimization.
Dynamic importance weighting is proposed as a Monte Carlo method that has the capability to sample relevant parts of the configuration space even in the presence of many steep energy minima. The method relies on an additional dynamic variable (the importance weight) to help the system overcome steep barriers. A non-Metropolis theory is developed for the construction of such weighted samplers. A...
متن کاملAdaptive Term Weighting through Stochastic Optimization
Term weighting strongly influences the performance of text mining and information retrieval approaches. Usually term weights are determined through statistical estimates based on static weighting schemes. Such static approaches lack the capability to generalize to different domains and different data sets. In this paper, we introduce an on-line learning method for adapting term weights in a sup...
متن کاملOnline Convex Optimization for Cumulative Constraints
We propose an algorithm for online convex optimization which examines a clipped long-term constraint of the form T ∑ t=1 [g(xt)]+, encoding the cumulative constraint violation. Previous literature has focused on longterm constraints of the form T ∑ t=1 g(xt), for which strictly feasible solutions can cancel out the effects of violated constraints. In this paper, we generalize the results in [16...
متن کاملRecursive Exponential Weighting for Online Non-convex Optimization
In this paper, we investigate the online non-convex optimization problem which generalizes the classic online convex optimization problem by relaxing the convexity assumption on the cost function. For this type of problem, the classic exponential weighting online algorithm has recently been shown to attain a sub-linear regret of O( √ T log T ). In this paper, we introduce a novel recursive stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2015
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-015-0374-4